Universal Grobner Bases for Maximal Minors

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Hilbert Zonotope and a Polynomial Time Algorithm for Universal Grobner Bases

We provide a polynomial time algorithm for computing the universal Gröbner basis of any polynomial ideal having a finite set of common zeros in fixed number of variables. One ingredient of our algorithm is an effective construction of the state polyhedron of any member of the Hilbert scheme Hilbn of n-long d-variate ideals, enabled by introducing the Hilbert zonotope Hn and showing that it simu...

متن کامل

Grobner-shirshov Bases for Representation Theory

In this paper, we develop the Gr6bner-Shirshov basis theory for the representations of associative algebras by introducing the notion of Gr6bner-Shirshov pairs. Our result can be applied to solve the reduction problem in representation theory and to construct monomial bases of representations of associative algebras. As an illustration, we give an explicit construction of Gr6bner-Shirshov pairs...

متن کامل

Combinatorics of Maximal Minors

We continue the study of the Newton polytope Pm,n of the product of all maximal minors of an m x n-matrix of indeterminates. The vertices of Pm,n are encoded by coherent matching fields A = (A z) , where z runs over all m-element subsets of columns, and each Az is a bijection z —> [m]. We show that coherent matching fields satisfy some axioms analogous to the basis exchange axiom in the matroid...

متن کامل

Middle-Solving Grobner bases algorithm for cryptanalysis over finite fields

Algebraic cryptanalysis usually requires to recover the secret key by solving polynomial equations. Gröbner bases algorithm is a well-known method to solve this problem. However, a serious drawback exists in the Gröbner bases based algebraic attacks, namely, any information won’t be got if we couldn’t work out the Gröbner bases of the polynomial equations system. In this paper, firstly, a gener...

متن کامل

Conormal Geometry of Maximal Minors

Let A be a Noetherian local domain, N be a finitely generated torsion-free module, and M a proper submodule that is generically equal to N . Let A[N ] be an arbitrary graded overdomain of A generated as an A-algebra by N placed in degree 1. Let A[M ] be the subalgebra generated by M . Set C := Proj(A[M ]) and r := dimC. Form the (closed) subset W of Spec(A) of primes p where A[N ]p is not a fin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2014

ISSN: 1073-7928,1687-0247

DOI: 10.1093/imrn/rnu032